A table of upper bounds for binary codes
نویسندگان
چکیده
Let ( ) denote the maximum possible number of codewords in an ( ) binary code. We establish four new bounds on ( ), namely, (21 4) 43 689, (22 4) 87 378, (22 6) 6941, and (23 4) 173 491. Furthermore, using recent upper bounds on the size of constant-weight binary codes, we reapply known methods to generate a table of bounds on ( ) for all 28. This table extends the range of parameters compared with previously known tables.
منابع مشابه
Bounds on Mixed Binary/Ternary Codes
Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions.
متن کاملNew upper bounds for binary covering codes
Improved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of length n and coveting radius r. The new bounds are obtained by both new and old constructions; in many of these, computer search using simulated annealing and tabu search plays a central role. Some new linear coveting codes are also presented. An updated table of upper bounds on K(n,r), n~<64, r~<12, is...
متن کاملConstant Weight Codes with Package CodingTheory.m in Mathematica
The author offers the further development of package CodingTheory.m [1] in the direction of research of properties and parameters of Constant weight codes (lower and upper bounds) based on works [2], [3] and also using the Table of Constant Weight Binary Codes (online version, Neil J. A. Sloane: Home Page http://www.research.att.com/~njas/codes/Andw/) and the table of upper bounds on A(n, d, w)...
متن کاملOn Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...
متن کاملTight Bounds on the Minimum Euclidean Distance for Block Coded Phase Shift Keying
We present upper and lower bounds on the minimum Euclidean distance dEmin(C) for block coded PSK. The upper bound is an analytic expression depending on the alphabet size q, the block length n and the number of codewords jCj of the code C. This bound is valid for all block codes with q 4 and with medium or high rate codes where jCj > (q=3). The lower bound is valid for Gray coded binary codes o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001